Computing the Voronoi Diagram on a Coarse-Grained Multicomputer
نویسنده
چکیده
In this report, the implementation of an algorithm for computing the 2D Voronoi diagram on a coarse-grained multicomputer (CGM) is presented. The used metric is Euclidean. In the coarsegrained model, each processor has O p ≫O 1 local memory, where n is the size of the data and p the number of processors. In one communication round, each processor can exchange data with any other processor, but it must not send or receive more than h=O p data. With this definition, the computation of the Voronoi diagram can be accomplished in O log p communication rounds, using O n log 2 n p local computation per processor with high probability. To achieve this complexity p = p data must be given. This corresponds to a scalability of =1 according to the CGM model.
منابع مشابه
An improved algorithm for Hausdorff Voronoi diagram for non-crossing sets∗†‡
We present an improved algorithm for building a Hausdorff Voronoi diagram (HVD) for non-crossing objects. Our algorithm runs in O(n log4 n) time, where n is the total number of points defining the objects in the plane. This improves on previous results and solves an open problem posed by Papadopoulou and Lee [15]. Moreover, our algorithm is parallelizable. In cluster computing architectures (su...
متن کاملCommunication-Efficient Deterministic Parallel Algorithms for Planar Point Location and 2d Voronoi Diagram
In this paper we describe deterministic parallel algorithms for planar point location and for building the Voronoi Diagram of n co-planar points. These algorithms are designed for BSP-like models of computation, where p processors, with O(~) ~> O(1) local memory each, communicate through some arbitrary interconnection network. They axe communication-efficient since they require, respectively, O...
متن کاملReducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully parallel disk I/O. In this paper we present a deterministic simulation technique which transforms parallel algorithms into (parallel) external memory algorithms. Specifically, we present a deterministic simulation techniq...
متن کاملConstructing higher-order Voronoi diagrams in parallel
We use Lee’s sequential algorithm [17] to create the first parallel algorithm which constructs the order-k Voronoi diagram of a planar point set. The algorithm is developed and analyzed within two parallel models, the fine-grained PRAM and the coarse-grained CGM. Its applications include k-nearest neighbor searches in a parallel context, which are important for many applications in computationa...
متن کاملA Load Balancing Technique for Some Coarse-Grained Multicomputer Algorithms
The paper presents a load balancing method for some CGM (Coarse-Grained Multicomputer) algorithms. This method can be applied on different dynamic programming problems such as: Longest Increasing Subsequence, Longest Common Subsequence, Longest Repeated Suffix Ending at each point in a word and Detection of Repetitions. We present also experimental results showing that our method is efficient.
متن کامل